Revisiting Hamiltonian De omposition of the Hyper ube

On Some Classes of Functions and Hypercubes

X iv :0 81 2. 43 67 v1 [ cs .D M ] 2 3 D ec 2 00 8 ON SOME CLASSES OF FUNCTIONS AND HYPERCUBES DIMITER STOICHKOV KOVACHEV Abstra t. In this paper, some lasses of dis rete fun tions of k-valued logi are onsidered, that depend on sets of their variables in a parti ular way. Obtained results allow to " onstru t" these fun tions and to present them in their tabular, analyti al or matrix form, that ...

MORE ON EDGE HYPER WIENER INDEX OF GRAPHS

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

Beyond Hypertree Width: De omposition Methods Without De ompositions

On Hyper Pseudo BCK-algebras

In this paper, we introduce the notion of hyper pseudo B C K - algebras, which is a generalization of pseudo BCK -algebras and hyper BCK -algebras and we investigates some related properties. In follow, we de ne some kinds of hyper pseudo BCK -ideals of a hyper pseudo BCK - algebra and we find the relations among them. Finally, we characterize the hyper pseudo BCK -ideals of type 4 generated by...

Output Models of MAP / PH / 1 ( / K )

For non-trivial (open) queueing networks, traÆ -based de omposition often represents the only feasible { and at the same time fast { solution method besides simulation. The network is partitioned into individual nodes whi h are analyzed in isolation with respe t to approximate internal traÆ representations. Sin e the orrelations of network traÆ may have a onsiderable impa t on performan e measu...